3.25. If comm sz D p, we mentioned that the "ideal" speedup is p. Is it possible to do better? a. Consider a parallel program that computes a vector sum. If we only time the vector sum-that is, we ignore input and output of the vectors-how might this program achieve speedup greater than p? b. A program that achieves speedup greater than p is said to have superlinear speedup. Our vector sum example only achieved superlinear speedup by overcoming certain "resource limitations." What were these resource limitations? Is it possible for a program to obtain superlinear speedup without overcoming resource limitations? | |
| View Solution | |
| << Back | Next >> |